Job Size for Internet Parallel Computing
نویسندگان
چکیده
In this paper, we present a performance model and the experimental results of parallel execution of Java Remote Method Invocation (RMI). The Java RMI is used for remote execution of parallel jobs on the Internet. The main use of the model is to determine the job size of the distributed objects that are suitable for the meta-computing on the Internet.
منابع مشابه
Improving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملE ect of Job Size Characteristics on Job Scheduling Performance
A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system e ciently. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics a ...
متن کاملParallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملA Minimum Execution Time Job Scheduling Algorithms in Simulated Grid Environment
To achieve the promising potentials by using tremendous distributed resources, effective and efficient scheduling algorithms are fundamentally important. Scheduling such applications is challenging because target resources are heterogeneous, their load and availability varies dynamically. Previous parallel system was assumed to be organized with homogeneous platform and connected via memory, bu...
متن کاملA Comparison of Workload Traces from Two Production Parallel Machines
The analysis of workload traces from real production parallel machines can aid a wide variety of parallel processing research, providing a realistic basis for experimentation in the management of resources over an entire workload. We analyze a ve-month workload trace of an Intel Paragon machine supporting a production parallel workload at the San Diego Supercomputer Center (SDSC), comparing and...
متن کامل